946. Validate Stack Sequences - LeetCode Solution

class Solution:
    def validateStackSequences(self, pushed: List[int], popped: List[int]) -> bool:
        stack = []
        
        if len(pushed) == 0:
            return True
        
        
        for i in range(len(pushed)):
            stack.append(pushed[i])
            for j in range(len(popped)):
                if(len(stack) == 0):
                    break

                if (stack[-1] == popped[0]):
                    popped.remove(popped[0])
                    stack.pop()




        if len(stack) ==0:
            return True
        else:
            return False